Combining Max-min and Max-max Approaches for Robust SoS Architecting
نویسندگان
چکیده
منابع مشابه
Min-max Bias Robust Regression
This the problem maximum asymptotic bias of regression estimates over a-contamination for the joint of the response carriers. Two classes of estimates are treated: (1) Msestimates with bounded function p applied to the scaled residuals, using a very general class of scale estimates, and (2) Bounded influence function type generalized M-estimates. Estimates in the first class are oblta1rled as p...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملMin-max and min-max (relative) regret approaches to representatives selection problem
The following optimization problem is studied. There are several sets of integer positive numbers whose values are uncertain. The problem is to select one representative of each set such that the sum of the selected numbers is minimum. The uncertainty is modeled by discrete and interval scenarios, and the min–max and min–max (relative) regret approaches are used for making a selection decision....
متن کاملMin, Max, and Sum
This paper provides characterization theorems for preferences that can be represented by U(x1, ..., xn)=min{xk}, U(x1, ..., xn)=max{xk}, U(x1, ..., xn)=; u(xk), or combinations of these functionals. The main assumption is partial separability, where changing a common component of two vectors does not reverse strict preferences, but may turn strict preferences into indifference. We discuss appli...
متن کاملMax and min limiters
If A ⊆ ω, n ≥ 2, and the function max({x1, . . . , xn} ∩ A) is partial recursive, it is easily seen that A is recursive. In this paper, we weaken this hypothesis in various ways (and similarly for “min” in place of “max”) and investigate what effect this has on the complexity of A. We discover a sharp contrast between retraceable and coretraceable sets, and we characterize sets which are the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Procedia Computer Science
سال: 2016
ISSN: 1877-0509
DOI: 10.1016/j.procs.2016.09.299